Constructing Almost Peripheral and Almost Self-centered Graphs Revisited
نویسندگان
چکیده
The center and the periphery of a graph is the set of vertices with minimum resp. maximum eccentricity in it. A graph is almost self-centered (ASC) if it contains exactly two non-central vertices and is almost peripheral (AP) if all its vertices but one lie in the periphery. Answering a question from (Taiwanese J. Math. 18 (2014), 463–471) it is proved that for any integer r ≥ 1 there exists an r-AP graph of order 4r− 1. Using this result it is proved that any graph G can be embedded into an r-AP graph by adding at most 4r − 2 vertices to G. A construction of ASC graphs from (Acta Math. Sin. (Engl. Ser.) 27 (2011), 2343–2350) is corrected and refined. Two new constructions of ASC graphs are also presented. Strong product graphs that are AP graphs are also characterized and it is shown that there are no strong product graphs that are ASC graphs. We conclude with some related open problems.
منابع مشابه
Almost Self-centered Median and Chordal Graphs
Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is m...
متن کاملOn almost self-complementary graphs
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc − I, where Xc denotes the complement of X and I a perfect matching (1-factor) in Xc. Almost self-complementary circulant graphs were first studied by Dobson and Šajna in 2004. In this paper we investigate some of the properties and constructions of general almost self-complementary graphs. In par...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملHomogeneously almost self-complementary graphs
A graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, we study a special class of vertex-transitive almost self-complementary graphs called homogeneously almost selfcomplementary. These graphs occur as factors of symmetric index-2 homogeneous factorizations of the “cocktail party graphs” K2n − nK2. We con...
متن کاملTwo-graphs, Double Covers over Complete Graphs, and Almost Self-complementary Graphs
A graph X is called almost self-complementary with respect to a perfect matching I in the complement Xc if it is isomorphic to the graph obtained from Xc by removing the edges of I. In this paper we investigate the relationship between self-complementary two-graphs and double covers over complete graphs that are almost self-complementary with respect to their set of fibres. In particular, we cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017